Fractional Covers of Hypergraphs with Bounded Multi-Intersection

Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued invariants are considered. The focus this paper on edge covers hypergraphs. Our main technical result generalizes and unifies previous conditions under which size support bounded independently hypergraph itself. This allows us to extend tractability results for checking if hypertree width a given $\leq k$ some constant $k$. We also show how our translate vertex covers.